A Router Mechanism for Extreme Overload

نویسنده

  • Hao Jiang
چکیده

Disasters such as the 9/11 attacks, as well as major and unpredictable events, can cause extreme network overload. By \extreme overload" we mean, rst, that the ooered load at a link is signiicantly higher than the link's capacity, and second, that the average throughput per session is too low. Under such conditions, the network can suuer from a form of \livelock" in which even though links are fully utilized, most users cannot complete their transfers. The underlying reasons are that the network carries many retransmitted packets, and that it services ows that are nally aborted by users or applications. To prevent extreme network overload, we propose a router mechanism called Guardian. Guardian is a form of admission control module that is automatically activated when it detects the onset of extreme overload at a network link. Guardian's objective is to allow at least some sessions to complete, rejecting new TCP or UDP sessions that would probably not manage to acquire a minimum acceptable throughput. Guardian does not require signalling, and it can be implemented using standard techniques for session counting and caching. This paper describes ongoing work. As such, we focus on the motivation for the proposed mechanism, and on Guardian's main design.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A High Performance Parallel IP Lookup Technique Using Distributed Memory Organization and ISCB-Tree Data Structure

The IP Lookup Process is a key bottleneck in routing due to the increase in routing table size, increasing traıc and migration to IPv6 addresses. The IP address lookup involves computation of the Longest Prefix Matching (LPM), which existing solutions such as BSD Radix Tries, scale poorly when traıc in the router increases or when employed for IPv6 address lookups. In this paper, we describe a ...

متن کامل

A High Performance Parallel IP Lookup Technique Using Distributed Memory Organization and ISCB-Tree Data Structure

The IP Lookup Process is a key bottleneck in routing due to the increase in routing table size, increasing traıc and migration to IPv6 addresses. The IP address lookup involves computation of the Longest Prefix Matching (LPM), which existing solutions such as BSD Radix Tries, scale poorly when traıc in the router increases or when employed for IPv6 address lookups. In this paper, we describe a ...

متن کامل

Design of a novel congestion-aware communication mechanism for wireless NoC architecture in multicore systems

Hybrid Wireless Network-on-Chip (WNoC) architecture is emerged as a scalable communication structure to mitigate the deficits of traditional NOC architecture for the future Multi-core systems. The hybrid WNoC architecture provides energy efficient, high data rate and flexible communications for NoC architectures. In these architectures, each wireless router is shared by a set of processing core...

متن کامل

بهبود کارایی پروتکلSIP در شرایط اضافه بار با استفاده از قابلیت مبتنی بر پنجره

The extent and diversity of systems provided by IP networks have made various technologies to approach integrating various types of access networks and converting to next generation network. The Session Initiation Protocol (SIP) with respect to facilities such as being in text form, end-to-end connection, independence from the type of transmitted data, and supporting various forms of transmissi...

متن کامل

The Nonlinear Mechanism of Phase Transition in Computer Networks

In this paper, the nonlinear mechanism of phase transition in computer networks is analyzed, and a distributed proxy approach is introduced to improve network performance based on the two-dimensional coupling model. Theoretical analysis figures out that the nonlinear mechanism of router is the essential reason of network performance phase transition. Simulation results reveal that the extreme c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002